Cryptographic Secrecy Analysis of Matrix Embedding
نویسندگان
چکیده
منابع مشابه
Secrecy of Steganographic Matrix Embedding Phillip
the secure embedding scheme (see Section II), it is hard to generate a watermarked version of c which has a low correlation with k 0. An estimation attack usually yields a watermarked object that still correlates well with k 0 ; a judge will reject the accusation on such an object, as it can only originate from a malicious seller (k 0 is only available to the seller). • Finally, can attempt to ...
متن کاملSecrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols
We present a computationally sound first-order system for security-analysis of protocols that places secrecy of nonces and keys in its center. Even trace properties such as agreement and authentication are proven via proving a non-trace property, namely, secrecy first with an inductive method. This results a very powerful system, the working of which we illustrate on the agreement and authentic...
متن کاملHow to Guarantee Secrecy for Cryptographic Protocols
In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we de...
متن کاملOn the Cryptographic Key Secrecy of the Strengthened Yahalom Protocol
Symbolic secrecy of exchanged keys is arguably one of the most important notions of secrecy shown with automated proof tools. It means that an adversary restricted to symbolic operations on terms can never get the entire key into its knowledge set. Cryptographic key secrecy essentially means computational indistinguishability between the real key and a random one, given the view of a much more ...
متن کاملA Semi-Decidable Procedure for Secrecy in Cryptographic Protocols
In this paper, we present a new semi-decidable procedure to analyze cryptographic protocols for secrecy based on a new class of functions that we call: the Witness-Functions. A Witness-Function is a reliable function that guarantees the secrecy in any protocol proved increasing once analyzed by it. Hence, the problem of correctness becomes a problem of protocol growth. A Witness-Function operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2013
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2013.802116